0.03/0.12 % Problem : Vampire---4.8_6002 : TPTP v0.0.0. Released v0.0.0. 0.03/0.14 % Command : run_E %s %d THM 0.14/0.35 % Computer : n015.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 1440 0.14/0.35 % WCLimit : 180 0.14/0.35 % DateTime : Mon Jul 3 13:25:10 EDT 2023 0.14/0.35 % CPUTime : 0.21/0.48 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.8ajGMSWnJ6/Vampire---4.8_6002 0.21/0.48 # Version: 3.1pre001-ho 0.21/0.50 # Preprocessing class: HSSSSMSSSLSNHHN. 0.21/0.50 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 900s (5) cores 0.21/0.50 # Starting sh5l with 180s (1) cores 0.21/0.50 # Starting full_lambda_10 with 180s (1) cores 0.21/0.50 # Starting full_lambda_6 with 180s (1) cores 0.21/0.50 # ehoh_best_nonlift_nonlambdatoforall with pid 6343 completed with status 0 0.21/0.50 # Result found by ehoh_best_nonlift_nonlambdatoforall 0.21/0.50 # Preprocessing class: HSSSSMSSSLSNHHN. 0.21/0.50 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 900s (5) cores 0.21/0.50 # No SInE strategy applied 0.21/0.50 # Search class: HGUNF-FFSF00-DHHFMSBN 0.21/0.50 # partial match(2): HGUNF-FFSF00-SHHFFSBN 0.21/0.50 # Scheduled 6 strats onto 5 cores with 900 seconds (900 total) 0.21/0.50 # Starting ho_unfolding_3 with 405s (1) cores 0.21/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 91s (1) cores 0.21/0.50 # Starting ehoh_best2_full_lfho with 102s (1) cores 0.21/0.50 # Starting lpo8_s with 102s (1) cores 0.21/0.50 # Starting lpo9_lambda_fix with 102s (1) cores 0.21/0.50 # lpo9_lambda_fix with pid 6356 completed with status 0 0.21/0.50 # Result found by lpo9_lambda_fix 0.21/0.50 # Preprocessing class: HSSSSMSSSLSNHHN. 0.21/0.50 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 900s (5) cores 0.21/0.50 # No SInE strategy applied 0.21/0.50 # Search class: HGUNF-FFSF00-DHHFMSBN 0.21/0.50 # partial match(2): HGUNF-FFSF00-SHHFFSBN 0.21/0.50 # Scheduled 6 strats onto 5 cores with 900 seconds (900 total) 0.21/0.50 # Starting ho_unfolding_3 with 405s (1) cores 0.21/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 91s (1) cores 0.21/0.50 # Starting ehoh_best2_full_lfho with 102s (1) cores 0.21/0.50 # Starting lpo8_s with 102s (1) cores 0.21/0.50 # Starting lpo9_lambda_fix with 102s (1) cores 0.21/0.50 # Preprocessing time : 0.002 s 0.21/0.50 # Presaturation interreduction done 0.21/0.50 0.21/0.50 # Proof found! 0.21/0.50 # SZS status Theorem 0.21/0.50 # SZS output start CNFRefutation 0.21/0.50 thf(decl_22, type, cNAT: (($i > $o) > $o) > $o). 0.21/0.50 thf(decl_23, type, cSUCC: (($i > $o) > $o) > ($i > $o) > $o). 0.21/0.50 thf(decl_24, type, cZERO: ($i > $o) > $o). 0.21/0.50 thf(decl_25, type, epred1_0: ($i > $o) > $o). 0.21/0.50 thf(decl_26, type, epred2_1: ((($i > $o) > $o) > $o) > ($i > $o) > $o). 0.21/0.50 thf(decl_27, type, epred3_0: (($i > $o) > $o) > $o). 0.21/0.50 thf(cNAT_def, axiom, ((cNAT)=(^[X3:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ cZERO)&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (cSUCC @ X6)))))=>(X5 @ X3)))))), file('/export/starexec/sandbox/tmp/tmp.8ajGMSWnJ6/Vampire---4.8_6002', cNAT_def)). 0.21/0.50 thf(cZERO_def, axiom, ((cZERO)=(^[X1:$i > $o]:(~(?[X2:$i]:((X1 @ X2)))))), file('/export/starexec/sandbox/tmp/tmp.8ajGMSWnJ6/Vampire---4.8_6002', cZERO_def)). 0.21/0.50 thf(cSUCC_def, axiom, ((cSUCC)=(^[X3:($i > $o) > $o, X1:$i > $o]:(?[X2:$i]:(((X1 @ X2)&(X3 @ (^[X4:$i]:((((X4)!=(X2))&(X1 @ X4)))))))))), file('/export/starexec/sandbox/tmp/tmp.8ajGMSWnJ6/Vampire---4.8_6002', cSUCC_def)). 0.21/0.50 thf(cTTTP6101, conjecture, ![X7:($i > $o) > $o]:(((cNAT @ X7)=>(cNAT @ (cSUCC @ X7)))), file('/export/starexec/sandbox/tmp/tmp.8ajGMSWnJ6/Vampire---4.8_6002', cTTTP6101)). 0.21/0.50 thf(c_0_4, plain, ((cNAT)=(^[Z0/* 6 */:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ (^[Z1/* 7 */:$i > $o]:(~(?[X9:$i]:((Z1 @ X9))))))&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (^[Z1/* 5 */:$i > $o]:(?[X10:$i]:(((Z1 @ X10)&(X6 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X10))&(Z1 @ Z2)))))))))))))=>(X5 @ Z0)))))), inference(fof_simplification,[status(thm)],[cNAT_def])). 0.21/0.50 thf(c_0_5, plain, ((cZERO)=(^[Z0/* 7 */:$i > $o]:(~(?[X2:$i]:((Z0 @ X2)))))), inference(fof_simplification,[status(thm)],[cZERO_def])). 0.21/0.50 thf(c_0_6, plain, ((cSUCC)=(^[Z0/* 19 */:($i > $o) > $o, Z1:$i > $o]:(?[X2:$i]:(((Z1 @ X2)&(Z0 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X2))&(Z1 @ Z2)))))))))), inference(fof_simplification,[status(thm)],[cSUCC_def])). 0.21/0.50 thf(c_0_7, plain, ((cNAT)=(^[Z0/* 6 */:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ (^[Z1/* 7 */:$i > $o]:(~(?[X9:$i]:((Z1 @ X9))))))&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (^[Z1/* 5 */:$i > $o]:(?[X10:$i]:(((Z1 @ X10)&(X6 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X10))&(Z1 @ Z2)))))))))))))=>(X5 @ Z0)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4, c_0_5]), c_0_6])). 0.21/0.50 thf(c_0_8, negated_conjecture, ~(![X7:($i > $o) > $o]:((![X11:(($i > $o) > $o) > $o]:((((X11 @ (^[Z0/* 7 */:$i > $o]:(~(?[X12:$i]:((Z0 @ X12))))))&![X13:($i > $o) > $o]:(((X11 @ X13)=>(X11 @ (^[Z0/* 5 */:$i > $o]:(?[X14:$i]:(((Z0 @ X14)&(X13 @ (^[Z1/* 8 */:$i]:((((Z1)!=(X14))&(Z0 @ Z1)))))))))))))=>(X11 @ X7)))=>![X16:(($i > $o) > $o) > $o]:((((X16 @ (^[Z0/* 7 */:$i > $o]:(~(?[X17:$i]:((Z0 @ X17))))))&![X18:($i > $o) > $o]:(((X16 @ X18)=>(X16 @ (^[Z0/* 5 */:$i > $o]:(?[X19:$i]:(((Z0 @ X19)&(X18 @ (^[Z1/* 8 */:$i]:((((Z1)!=(X19))&(Z0 @ Z1)))))))))))))=>(X16 @ (^[Z0/* 5 */:$i > $o]:(?[X15:$i]:(((Z0 @ X15)&(X7 @ (^[Z1/* 8 */:$i]:((((Z1)!=(X15))&(Z0 @ Z1))))))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTTTP6101]), c_0_6]), c_0_7])). 0.21/0.50 thf(c_0_9, negated_conjecture, ![X21:(($i > $o) > $o) > $o, X24:($i > $o) > $o]:(((((X21 @ (epred2_1 @ X21))|~(X21 @ (^[Z0/* 7 */:$i > $o]:(~(?[X12:$i]:((Z0 @ X12))))))|(X21 @ epred1_0))&(~(X21 @ (^[Z0/* 5 */:$i > $o]:(?[X14:$i]:(((Z0 @ X14)&(epred2_1 @ X21 @ (^[Z1/* 8 */:$i]:((((Z1)!=(X14))&(Z0 @ Z1))))))))))|~(X21 @ (^[Z0/* 7 */:$i > $o]:(~(?[X12:$i]:((Z0 @ X12))))))|(X21 @ epred1_0)))&(((epred3_0 @ (^[Z0/* 7 */:$i > $o]:(~(?[X17:$i]:((Z0 @ X17))))))&(~(epred3_0 @ X24)|(epred3_0 @ (^[Z0/* 5 */:$i > $o]:(?[X19:$i]:(((Z0 @ X19)&(X24 @ (^[Z1/* 8 */:$i]:((((Z1)!=(X19))&(Z0 @ Z1))))))))))))&~(epred3_0 @ (^[Z0/* 5 */:$i > $o]:(?[X15:$i]:(((Z0 @ X15)&(epred1_0 @ (^[Z1/* 8 */:$i]:((((Z1)!=(X15))&(Z0 @ Z1))))))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])). 0.21/0.50 thf(c_0_10, negated_conjecture, ![X5:(($i > $o) > $o) > $o]:(((X5 @ (epred2_1 @ X5))|(X5 @ epred1_0)|~((X5 @ (^[Z0/* 7 */:$i > $o]:(~(?[X68:$i]:((Z0 @ X68))))))))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.21/0.50 thf(c_0_11, negated_conjecture, (epred3_0 @ (^[Z0/* 7 */:$i > $o]:(~(?[X69:$i]:((Z0 @ X69)))))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.21/0.50 thf(c_0_12, negated_conjecture, ![X3:($i > $o) > $o]:(((epred3_0 @ (^[Z0/* 5 */:$i > $o]:(?[X70:$i]:(((Z0 @ X70)&(X3 @ (^[Z1/* 8 */:$i]:((((Z1)!=(X70))&(Z0 @ Z1))))))))))|~((epred3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.21/0.50 thf(c_0_13, negated_conjecture, ((epred3_0 @ (epred2_1 @ epred3_0))|(epred3_0 @ epred1_0)), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.21/0.50 thf(c_0_14, negated_conjecture, ![X5:(($i > $o) > $o) > $o]:(((X5 @ epred1_0)|~((X5 @ (^[Z0/* 5 */:$i > $o]:(?[X71:$i]:(((Z0 @ X71)&(epred2_1 @ X5 @ (^[Z1/* 8 */:$i]:((((Z1)!=(X71))&(Z0 @ Z1)))))))))))|~((X5 @ (^[Z0/* 7 */:$i > $o]:(~(?[X72:$i]:((Z0 @ X72))))))))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.21/0.50 thf(c_0_15, negated_conjecture, ((epred3_0 @ (^[Z0/* 5 */:$i > $o]:(?[X73:$i]:(((Z0 @ X73)&(epred2_1 @ epred3_0 @ (^[Z1/* 8 */:$i]:((((Z1)!=(X73))&(Z0 @ Z1))))))))))|(epred3_0 @ epred1_0)), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.21/0.50 thf(c_0_16, negated_conjecture, (epred3_0 @ epred1_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_11]), c_0_15])). 0.21/0.50 thf(c_0_17, negated_conjecture, ~((epred3_0 @ (^[Z0/* 5 */:$i > $o]:(?[X74:$i]:(((Z0 @ X74)&(epred1_0 @ (^[Z1/* 8 */:$i]:((((Z1)!=(X74))&(Z0 @ Z1))))))))))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.21/0.50 thf(c_0_18, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_16]), c_0_17]), ['proof']). 0.21/0.50 # SZS output end CNFRefutation 0.21/0.50 # Parsed axioms : 7 0.21/0.50 # Removed by relevancy pruning/SinE : 0 0.21/0.50 # Initial clauses : 8 0.21/0.50 # Removed in clause preprocessing : 3 0.21/0.50 # Initial clauses in saturation : 5 0.21/0.50 # Processed clauses : 80 0.21/0.50 # ...of these trivial : 1 0.21/0.50 # ...subsumed : 5 0.21/0.50 # ...remaining for further processing : 74 0.21/0.50 # Other redundant clauses eliminated : 2 0.21/0.50 # Clauses deleted for lack of memory : 0 0.21/0.50 # Backward-subsumed : 4 0.21/0.50 # Backward-rewritten : 5 0.21/0.50 # Generated clauses : 105 0.21/0.50 # ...of the previous two non-redundant : 97 0.21/0.50 # ...aggressively subsumed : 0 0.21/0.50 # Contextual simplify-reflections : 6 0.21/0.50 # Paramodulations : 23 0.21/0.50 # Factorizations : 2 0.21/0.50 # NegExts : 13 0.21/0.50 # Equation resolutions : 2 0.21/0.50 # Total rewrite steps : 5 0.21/0.50 # Propositional unsat checks : 0 0.21/0.50 # Propositional check models : 0 0.21/0.50 # Propositional check unsatisfiable : 0 0.21/0.50 # Propositional clauses : 0 0.21/0.50 # Propositional clauses after purity: 0 0.21/0.50 # Propositional unsat core size : 0 0.21/0.50 # Propositional preprocessing time : 0.000 0.21/0.50 # Propositional encoding time : 0.000 0.21/0.50 # Propositional solver time : 0.000 0.21/0.50 # Success case prop preproc time : 0.000 0.21/0.50 # Success case prop encoding time : 0.000 0.21/0.50 # Success case prop solver time : 0.000 0.21/0.50 # Current number of processed clauses : 46 0.21/0.50 # Positive orientable unit clauses : 3 0.21/0.50 # Positive unorientable unit clauses: 0 0.21/0.50 # Negative unit clauses : 3 0.21/0.50 # Non-unit-clauses : 40 0.21/0.50 # Current number of unprocessed clauses: 26 0.21/0.50 # ...number of literals in the above : 91 0.21/0.50 # Current number of archived formulas : 0 0.21/0.50 # Current number of archived clauses : 28 0.21/0.50 # Clause-clause subsumption calls (NU) : 528 0.21/0.50 # Rec. Clause-clause subsumption calls : 214 0.21/0.50 # Non-unit clause-clause subsumptions : 10 0.21/0.50 # Unit Clause-clause subsumption calls : 7 0.21/0.50 # Rewrite failures with RHS unbound : 0 0.21/0.50 # BW rewrite match attempts : 4 0.21/0.50 # BW rewrite match successes : 1 0.21/0.50 # Condensation attempts : 0 0.21/0.50 # Condensation successes : 0 0.21/0.50 # Termbank termtop insertions : 10452 0.21/0.50 0.21/0.50 # ------------------------------------------------- 0.21/0.50 # User time : 0.016 s 0.21/0.50 # System time : 0.003 s 0.21/0.50 # Total time : 0.019 s 0.21/0.50 # Maximum resident set size: 1900 pages 0.21/0.50 0.21/0.50 # ------------------------------------------------- 0.21/0.50 # User time : 0.073 s 0.21/0.50 # System time : 0.012 s 0.21/0.50 # Total time : 0.085 s 0.21/0.50 # Maximum resident set size: 1728 pages 0.21/0.50 % E---3.1 exiting 0.21/0.51 EOF